Przykad 9.1. Realizacja algorytmu przecicia siowego
public class BruteForceAlgorithm extends IntersectionDetection {

   public Hashtable<IPoint, ILineSegment[]> intersections
            (ILineSegment[]) segments) {

      startTime();
      initialize();
      for (int i = 0; i < segments.length-1; i++) {
         for (int j = i+1; j < segments.length; j++) {
            IPoint p = segments[i].intersection(segments[j]);
            if (p != null) {
               record (p, segments[i], segments[j]);
            }
         }
      }
      computeTime();
      return report;
   }
}
